Abstract

Real-time applications have highlighted the need for low-latency services, such as autonomous systems, IoTs, and high demonstrations, highlighting the need for efficient routing protocols that consider the proximity of the network edges. Edge -ware routing protocols take advantage of the underlying characteristics of edge computing to reduce communication delays and ensure optimal resource usage. This paper presents an intensive analysis of the Edge-Ware Routing Protocol (EARP), which focuses on its ability to reduce the delay by dynamically selecting the smallest and most efficient paths based on the closeness to the nodes. We examine various edge-aware routing strategies, including distance-based, topology-based, and material-ignorant approaches, and analyse their performance in terms of reduction in delay, network traffic efficiency, and resource usage. The simulation in real-world network scenarios displays the benefits of EARP in increasing the quality of service for delay-sensitive applications. In addition, the paper discusses the challenges and businesses involved in implementing the implementation of age -ware routing, such as scalability and fault tolerance. Conclusions highly highlight the ability of Edge-ware Protocol to play an important role in the future of less-inconvenient internet services.